A combinatorial bijection between linear extensions of equivalent orders
نویسندگان
چکیده
منابع مشابه
Linear Extensions of N-free Orders
We consider the number of linear extensions of an N-free order P . We give upper and lower bounds on this number in terms of parameters of the corresponding arc diagram. We propose a dynamic programming algorithm to calculate the number. The algorithm is polynomial if a new parameter called activity is bounded by a constant. The activity can be bounded in terms of parameters of the arc diagram....
متن کاملAggregate Functions, Conservative Extensions, and Linear Orders
1 Summary Practical database query languages are usually equipped with some aggregate functions. For example, \\nd mean of column" can be expressed in SQL. However, the manner in which aggregate functions were introduced in these query languages leaves something to be desired. Breazu-Tannen, Buneman, and Wong 3] introduced a nested relational language NRC(=) based on monads 16, 24] and structur...
متن کاملEpimorphisms Between Linear Orders
We study the relation on linear orders induced by order preserving surjections. In particular we show that its restriction to countable orders is a bqo.
متن کاملA Ramsey theorem for partial orders with linear extensions
We prove a Ramsey theorem for finite sets equipped with a partial order and a fixed number of linear orders extending the partial order. This is a common generalization of two recent Ramsey theorems due to Sokić. As a bonus, our proof gives new arguments for these two results.
متن کاملCombinatorial Markov chains on linear extensions
We consider generalizations of Schützenberger's promotion operator on the set L of linear extensions of a finite poset of size n. This gives rise to a strongly connected graph on L. By assigning weights to the edges of the graph in two different ways, we study two Markov chains, both of which are irreducible. The stationary state of one gives rise to the uniform distribution, whereas the weight...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1986
ISSN: 0012-365X
DOI: 10.1016/0012-365x(86)90147-0